1 3 - connected configurations ( n 3 ) with no Hamiltonian circuit
نویسنده
چکیده
For more than a century there have been examples of (n3) configurations without a Hamiltonian circuit. However, all these examples were only 2-connected. It has been believed that all geometric 3-connected configurations (n3) admit Hamiltonian circuits. We present a 3-connected configuration (253) of points and lines in the Euclidean plane which has no Hamiltonian circuit.
منابع مشابه
Connected Proper Interval Graphs and the Guard Problem in Spiral Polygons
The main purpose of this paper is to study the hamiltonicity of proper interval graphs and applications of these graphs to the guard problem in spiral polygons. The Hamiltonian path (circuit) problem is, given an undirected graph G = (V ,E), to determine whether G contains a Hamiltonian path (circuit). These two problems are well-known N P-complete problems. In the rst part of this paper, we sh...
متن کاملAn efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph
This paper describes an efficient algorithm to find a Hamiltonian circuit in an arbitrary 4-connected maximal planar graph. The algorithm is based on our simlplified version of Whitney's proof of his theorem: every 4-connected maximal planar graph has a Hamiltonian circuit.
متن کاملNew Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs
A graph G is s-Hamiltonian if for any S ⊆ V (G) of order at most s, G−S has a Hamiltonian-cycle, and s-Hamiltonian connected if for any S ⊆ V (G) of order at most s, G − S is Hamiltonian-connected. Let k > 0, s ≥ 0 be two integers. The following are proved in this paper: (1) Let k ≥ s+ 2 and s ≤ n− 3. If G is a k-connected graph of order n and if max{d(v) : v ∈ I} ≥ (n+s)/2 for every independen...
متن کاملHamiltonian cycles in regular graphs of moderate degree
In this paper we prove that if k is an integer no less than 3, and if G is a two-connected graph with 2n a vertices, a E {0, 1}, which is regular of degree n k, then G is Hamiltonian if a = 0 and n > k2 + k + 1 or if a = I and n > 2k 2 3k =, 3 . We use the notation and terminology of [1] . Gordon [4] has proved that there are only a small number of exceptional graphs with 2n vertices which are ...
متن کاملClaw-free 3-connected P11-free graphs are hamiltonian
We show that every 3-connected claw-free graph which contains no induced copy of P11 is hamiltonian. Since there exist non-hamiltonian 3-connected claw-free graphs without induced copies of P12 this result is, in a way, best possible. 1. Statement of the main result A graph G is {H1, H2, . . . Hk}-free if G contains no induced subgraphs isomorphic to any of the graphs Hi, i = 1, 2, . . . , k. A...
متن کامل